Decoding by sequential code reduction

نویسندگان

  • Luther D. Rudolph
  • Carlos R. P. Hartmann
چکیده

A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated, and two decoding options for the Golay code are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Sequential Decoding of Polar Codes

An extension of the stack decoding algorithm for polar codes is presented. The paper introduces a new score function, which enables one to accurately compare paths of different length. This results in significant complexity reduction with respect to the original stack algorithm at the expense of negligible performance loss.

متن کامل

Sequential Decoding for Wireless Communications

Sequential decoding of long constraint length convolutional codes is proposed as a candidate coding scheme for high quality wireless services. Performance of sequential decoding on Rayleigh fading channels is obtained theoretically and by simulations. Results show that sequential decoding is a good candidate for data oriented services in future wireless communication systems. The applicability ...

متن کامل

A Bidirectional List-Sequential (BI-LISS) Equalizer for Turbo Schemes

In the context of coded transmission over intersymbol interference channels we investigate a bidirectional list-sequential equalizer (BI-LISS) suitable for turbo schemes. Especially for channels with an unmanageable high number of states for a trellis based APP equalization this sequential algorithm shows almost optimal performance with much smaller complexity. Generally, the list-sequential (L...

متن کامل

A Unified Approach to Coding Labeled Trees

We consider the problem of coding labeled trees by means of strings of node labels and we present a unified approach based on a reduction of both coding and decoding to integer (radix) sorting. Applying this approach to four well-known codes introduced by Prüfer [18], Neville [17], and Deo and Micikevicius [5], we close some open problems. With respect to coding, our general sequential algorith...

متن کامل

Forced sequence sequential decoding: a concatenated coding system with iterated sequential inner decoding

We describe a concatenated coding system with iterated sequential inner decoding. The system uses convolutional codes of very long constraint length and operates on iterations between an inner Fano decoder and an outer Reed-Solomon decoder.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1973